Back to course home
0% completed
Vote For New Content
Tree Breadth First Search (BFS) Pattern (easy)
Introduction to Tree Breadth First Search Pattern
Sum of Nodes with Even-Valued Grandparent (medium)
Solution: Sum of Nodes with Even-Valued Grandparent
All Nodes Distance K in Binary Tree (medium)
Solution: All Nodes Distance K in Binary Tree
Level Order Successor (easy)
Solution: Level Order Successor
Connect Level Order Siblings (medium)
Solution: Connect Level Order Siblings
Connect All Level Order Siblings (medium)
Solution: Connect All Level Order Siblings
Tree Depth First Search (DFS) Pattern (medium)
Introduction to Tree Depth First Search Pattern
Binary Tree Path Sum (easy)
Solution: Binary Tree Path Sum
Count Good Nodes in Binary Tree (medium)
Solution: Count Good Nodes in Binary Tree
Path Sum III (medium)
Solution: Path Sum III
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Maximum Difference Between Node and Ancestor (medium)
Solution: Maximum Difference Between Node and Ancestor
Root to Leaf Path Pattern (medium)
Introduction to Root to Leaf Path Pattern
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Sum of Root To Leaf Binary Numbers (easy)
Solution: Sum of Root To Leaf Binary Numbers
Insufficient Nodes in Root to Leaf Paths (medium)
Solution: Insufficient Nodes in Root to Leaf Paths
Smallest String Starting From Leaf (medium)
Solution: Smallest String Starting From Leaf
Pseudo-Palindromic Paths in a Binary Tree (medium)
Solution: Pseudo-Palindromic Paths in a Binary Tree
All Paths for a Sum (medium)
Solution: All Paths for a Sum
Sum of Path Numbers (medium)
Solution: Sum of Path Numbers
Path With Given Sequence (medium)
Solution: Path With Given Sequence
Count Paths for a Sum (medium)
Solution: Count Paths for a Sum
Leaf Processing Pattern (medium)
Introduction to Leaf Processing Pattern
Sum of Left Leaves (easy)
Solution: Sum of Left Leaves
Leaf-Similar Trees (easy)
Solution: Leaf-Similar Trees
Check if all leaves are at same level (medium)
Solution: Check if all leaves are at same level
Delete Leaves With a Given Value (medium)
Solution: Delete Leaves With a Given Value
Deepest Leaves Sum (medium)
Solution: Deepest Leaves Sum
Tree View Pattern (medium)
Introduction to Tree View Pattern
Right View of a Binary Tree (medium)
Solution: Right View of a Binary Tree
Top View Of the Binary Tree (medium)
Solution: Top View Of the Binary Tree
Bottom View Of the Binary Tree (medium)
Solution: Bottom View Of the Binary Tree
Boundary of Binary Tree (medium)
Solution: Boundary of Binary Tree
Comparison of Two Trees Pattern (medium)
Introduction to Comparison of Two Trees Pattern
Symmetric Tree (easy)
Solution: Symmetric Tree
Mirror Image Trees (medium)
Solution: Mirror Image Trees
Subtree of Another Tree (easy)
Solution: Subtree of Another Tree
Isomorphic Trees (medium)
Solution: Isomorphic Trees
Serialize and Deserialize Tree Pattern (hard)
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Maximum Depth of N-ary Tree (easy)
Problem Statement
Given a root of the n-ary tree, return the maximum depth of the tree.
The maximum depth refers to the longest path from the root node to any leaf node.
Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value.
Examples
Example 1:
- Input: root =
[1,null,2,3,4,null,5]
- Expected Output:
3 - Justification: The path from the root node
1to the farthest leaf node5goes through nodes1 -> 2 -> 5, making the depth3.
Example 2:
- Input: root =
[1,null,2,3,4,null,5,null,6,7,8,null,9,10,null,11,12]
- Expected Output:
4 - Justification: The longest path from the root node
1to the farthest leaf node11or12is1 -> 2 -> 5 -> 12, resulting in a depth of4.
Example 3:
- Input: root =
[10,null,20,30,null,40,null,50,null,60]
- Expected Output:
4 - Justification: The path from the root node
10to the farthest leaf node60is10 -> 20 -> 40 -> 60, making the depth4.
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Tree Diameter
Solution: Maximum Depth of N-ary Tree
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself